Task granularity analysis in logic programs
نویسندگان
چکیده
منابع مشابه
Towards Granularity Based Control of Parallelism in Logic Programs
Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a number of overheads which appear in practice, such as process creation and scheduling, which can indu...
متن کاملThe Granularity Analysis of MPI Parallel Programs
Computational grid for high performance computing is the current research focus of computer science. Furthermore, the performance analysis and evaluation toward parallel programs is critical in grid computing environment. This paper studies and analyzes the granularity of MPI parallel programs. By means of basic-block and flow analysis tree, we develop a Program Basic-block Analysis System (PBA...
متن کاملGranularity and Concurrent Separation Logic
When defining the semantics of shared-memory concurrent programming languages, one conventionally has to make assumptions about the atomicity of actions such as assignments. Running on physical hardware, these assumptions can fail to hold in practice, which puts in question reasoning about their concurrent execution. We address an observation, due to John Reynolds, that processes proved sound i...
متن کاملA Methodology for Granularity-Based Control of Parallelism in Logic Programs
Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a number of overheads which appear in practice, such as process creation and scheduling, which can indu...
متن کاملAn Heuristics for Load Balancing and Granularity Control in the Parallel Instantiation of Disjunctive Logic Programs
In this paper we present a dynamic heuristics that allows for improving the performance of a parallel instantiator algorithm based on the DLV system. In this system, each rule is rewritten in several “splits” of the same size that are assigned to a number of parallel instatiator subprocesses. The new heuristics allows for dynamically determining an optimal amount of work that has to be assigned...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1990
ISSN: 0362-1340,1558-1160
DOI: 10.1145/93548.93564